全文获取类型
收费全文 | 4891篇 |
免费 | 812篇 |
国内免费 | 684篇 |
专业分类
电工技术 | 503篇 |
综合类 | 585篇 |
化学工业 | 103篇 |
金属工艺 | 98篇 |
机械仪表 | 598篇 |
建筑科学 | 193篇 |
矿业工程 | 58篇 |
能源动力 | 61篇 |
轻工业 | 27篇 |
水利工程 | 79篇 |
石油天然气 | 150篇 |
武器工业 | 105篇 |
无线电 | 472篇 |
一般工业技术 | 527篇 |
冶金工业 | 67篇 |
原子能技术 | 12篇 |
自动化技术 | 2749篇 |
出版年
2024年 | 44篇 |
2023年 | 114篇 |
2022年 | 163篇 |
2021年 | 174篇 |
2020年 | 236篇 |
2019年 | 211篇 |
2018年 | 204篇 |
2017年 | 199篇 |
2016年 | 255篇 |
2015年 | 250篇 |
2014年 | 318篇 |
2013年 | 336篇 |
2012年 | 332篇 |
2011年 | 367篇 |
2010年 | 259篇 |
2009年 | 279篇 |
2008年 | 304篇 |
2007年 | 328篇 |
2006年 | 284篇 |
2005年 | 269篇 |
2004年 | 257篇 |
2003年 | 174篇 |
2002年 | 179篇 |
2001年 | 132篇 |
2000年 | 153篇 |
1999年 | 104篇 |
1998年 | 89篇 |
1997年 | 90篇 |
1996年 | 58篇 |
1995年 | 50篇 |
1994年 | 42篇 |
1993年 | 24篇 |
1992年 | 21篇 |
1991年 | 19篇 |
1990年 | 16篇 |
1989年 | 15篇 |
1988年 | 6篇 |
1987年 | 5篇 |
1986年 | 5篇 |
1985年 | 3篇 |
1984年 | 2篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 4篇 |
1962年 | 1篇 |
1961年 | 1篇 |
1957年 | 3篇 |
1955年 | 2篇 |
排序方式: 共有6387条查询结果,搜索用时 0 毫秒
81.
针对网格仿真中的事件调度问题,提出一种新的时序管理方法。该方法同时考虑网格仿真成员的按需模型服务调用与成员间的交互,对仿真中具体存在的事件进行分类,建立成员的相关局部事件触发矩阵和时序关系矩阵,并应用Mutli-AWS算法求解每个事件的开始时间。实验结果证明,该方法可以确保成员之间事件的时序关系,有效解决成员按需模型服务调用问题。 相似文献
82.
为了满足小推力航天器交会轨迹的快速性设计需求,基于形状逼近理论,设计了一种三维轨迹模型.将轨迹设计问题转换为求解傅里叶级数的系数问题,避免了轨迹运动方程非线性强、难以求解的难题,极大地提高了计算效率.考虑到推力加速度的限制,建立了加速度约束方程,并结合轨迹的运动方程,给出了傅里叶级数的求解过程.同时根据边界条件和最大推力加速度值,定性地分析了傅里叶系数的存在条件.仿真验证了该方法的正确性和可行性,并从计算效率上与高斯伪谱法进行了对比,结果表明本文的方法计算耗时仅为高斯伪谱法的0.67%. 相似文献
83.
The university timetabling problem (UTP) has been studied by numerous research groups for decades. In addition to addressing hard and soft constraints, we extend the UTP by considering consecutiveness and periodicity constraints of multi-session lectures, which are common in many eastern Asian universities. Because schedulers can decide the consecutiveness and periodicity constraints for the multi-session lectures within a limited ratio, we consider these novel decision variables in our model. We develop a mixed integer linear program for the UTP. For the analysis, we convert the UTP into the three-dimensional container packing problem (3DCPP) and create a hybrid genetic algorithm (HGA), which has been shown to be efficient in solving the 3DCPP. We also develop a tabu search algorithm based on the existing UTP literature and compare the findings with that of our HGA. The results show that our HGA obtains a better solution than the tabu search algorithm in a reasonable amount of time. 相似文献
84.
We investigate the linear complementarity problem with uncertain parameters (ULCP) which affect the linear mapping affinely or quadratically. Assuming that the distribution of the uncertain parameters belongs to some ambiguity set with prescribed partial information, we formulate the ULCP as a distributionally robust optimization reformulation named as the distributionally robust complementarity problem (DRCP), which minimizes the worst case of an expected complementarity measure with a joint chance constraint that the probability of the linear mapping being nonnegative is not less than a given level. Applying the cone dual theory and S-procedure, we conservatively approximate the DRCP as a nonlinear semidefinite programming (NSDP) with bilinear matrix inequalities, which can be solved by the NSDP solver PENLAB. The preliminary numerical test on a constrained stochastic linear quadratic control problem shows that the DRCP as well as the corresponding solution method is promising. 相似文献
85.
In this study, we consider a boundary control problem of a flexible manipulator with input disturbances and output constraints, achieving pre‐set performance attributes on position tracking error and the deflection error at the end of the beam. The dynamics of the system are represented by partial differential equations (PDEs). With the Lyapunov's direct method, a boundary controller with disturbance observer is designed to regulate the angular position and suppress elastic vibration simultaneously. The proposed control scheme allows the errors to converge to an arbitrarily small residual set, with convergence rate larger than a pre‐specified value. Numerical simulations demonstrate the effectiveness of the proposed scheme. 相似文献
86.
Wei Lin Youhong Tang Chengbi Zhao Xu Liu Gongquan Zhu Feng Jiang 《Computer aided design》2011,43(12):1803-1813
In this study, an algorithm is designed specifically for automatic finite element (FE) mesh generation on the transverse structure of hulls reinforced by stiffeners. Stiffeners attached to the transverse structure are considered as line constraints in the geometry boundary. For the FE mesh generation used in this study, the line constraints are treated as boundaries and by that means the geometry domain attached to the line constraints is decomposed into sub-domains, constrained only by the closed boundaries. Then, the mesh can be generated directly on those sub-domains by the traditional approach. The performance of the proposed algorithm is evaluated and the quality of the generated mesh meets expectations. 相似文献
87.
The coordination modelling language Paradigm addresses collaboration between components in terms of dynamic constraints. Within a Paradigm model, component dynamics are consistently specified at various levels of abstraction. The operational semantics of Paradigm is given. For a large, general subclass of Paradigm models a translation into process algebra is provided. Once expressed in process algebra, relying on a correctness result, Paradigm models are amenable to process algebraic reasoning and to verification via the mCRL2 toolset. Examples of a scheduling problem illustrate the approach. 相似文献
88.
A shape prior constraint for implicit active contours 总被引:2,自引:0,他引:2
We present a shape prior constraint to guide the evolution of implicit active contours. Our method includes three core techniques. Firstly, a rigid registration is introduced, using a line search method within a level set framework. The method automatically finds the time step for the iterative optimization processes. The order for finding the optimal translation, rotation and scale is derived experimentally. Secondly, a single reconstructed shape is created from a shape distribution of a previously acquired learning set. The reconstructed shape is applied to guide the active contour evolution. Thirdly, our method balances the impact of the shape prior versus the image guidance of the active contour. A mixed stopping condition is defined based on the stationarity of the evolving curve and the shape prior constraint. Our method is completely non-parametric and avoids taking linear combinations of non-linear signed distance functions, which would cause problems because distance functions are not closed under linear operations. Experimental results show that our method is able to extract the desired objects in several circumstances, namely when noise is present in the image, when the objects are in slightly different poses and when parts of the object are invisible in the image. 相似文献
89.
紧密衔接工序组联动的综合调度算法 总被引:2,自引:0,他引:2
由于现有的工序间存在紧密衔接条件的复杂产品综合调度问题, 采用的移动交换算法不易于软件实现且没有考虑移动工序后产生的连锁反应引起较高算法复杂度的问题, 提出将具有紧密衔接约束条件的工序组进行统一联动的综合调度算法.该算法利用将具有紧密衔接约束条件的工序分组的扩展加工工艺树模型, 按路径上属于工序组的工序个数多少确定所在路径工序组调度的次序, 通过降低对工序组的限制要求降低算法复杂度; 对于被调度工序组中各工序的前序工序, 按工序组中工序的加工顺序确定调度次序, 对某个工序的前序工序采用复杂度较低的拟关键路径法确定工序的调度次序; 调度完所有紧密衔接工序组后, 剩余的标准工序按拟关键路径法确定调度顺序; 采取工序首次适应调度算法调度标准工序和工序组, 由于工序组中工序采取按序紧密衔接的联动调度方式确定工序组的开始时间, 避免了二次调整, 进一步降低了算法复杂度. 分析和实例表明, 所提出的综合算法比以往算法复杂度更低, 调度结果更优且更易于实现. 相似文献
90.